A Duality for Distributive Unimodal Logic
نویسنده
چکیده
We introduce distributive unimodal logic as a modal logic of binary relations over posets which naturally generalizes the classical modal logic of binary relations over sets. The relational semantics of this logic is similar to the relational semantics of intuitionistic modal logic and positive modal logic, but it generalizes both of these by placing no restrictions on the accessibility relation. We introduce a corresponding quasivariety of distributive lattices with modal operators and prove a completeness theorem which embeds each such algebra in the complex algebra of its canonical modal frame. We then extend this embedding to a duality theorem which unifies and generalizes the duality theorems for intuitionistic modal logic obtained by A. Palmigiano and for positive modal logic obtained by S. Celani and A. Jansana. As a corollary to this duality theorem, we obtain a Hennessy-Milner theorem for biintuitionistic unimodal logic, which is the expansion of distributive unimodal logic by bi-intuitionistic connectives.
منابع مشابه
FUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملA duality between fuzzy domains and strongly completely distributive $L$-ordered sets
The aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. All values aretaken in a fixed frame $L$. A definition of (strongly) completelydistributive $L$-ordered sets is introduced. The main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $L$-ordereds...
متن کاملDiscrete duality and its application to bounded lattices with operators
Duality theory emerged from the work by Marshall Stone [18] on Boolean algebras and distributive lattices in the 1930s. Later in the early 1970s Larisa Maksimova [10, 11] and Hilary Priestley [15, 16] developed analogous results for Heyting algebras, topological Boolean algebras, and distributive lattices. Duality for bounded, not necessarily distributive lattices, was developed by Alstir Urquh...
متن کاملDistributive Lattices with a Generalized Implication: Topological Duality
In this paper we introduce the notion of generalized implication for lattices, as a binary function⇒ that maps every pair of elements of a lattice to an ideal. We prove that a bounded lattice A is distributive if and only if there exists a generalized implication ⇒ defined in A satisfying certain conditions, and we study the class of bounded distributive lattices A endowed with a generalized im...
متن کاملDistributive lattices with strong endomorphism kernel property as direct sums
Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem 2.8}). We shall determine the structure of special elements (which are introduced after Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...
متن کامل